Genetic Local Search for the TSP: New Results
نویسنده
چکیده
| The combination of local search heuristics and genetic algorithms has been shown to be an eeective approach for nding near-optimum solutions to the traveling salesman problem. In this paper, previously proposed genetic local search algorithms for the symmetric and asymmetric traveling salesman problem are revisited and potential improvements are identiied. Since local search is the central component in which most of the computation time is spent, improving the eeciency of the local search operators is crucial for improving the overall performance of the algorithms. The modiications of the algorithms are described and the new results obtained are presented. The results indicate that the improved algorithms are able to arrive at better solutions in signiicantly less time.
منابع مشابه
A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...
متن کاملOPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA
In this article, by Partitioning of designing space, optimization speed is tried to be increased by GA. To this end, designing space search is done in two steps which are global search and local search. To achieve this goal, according to meshing in FEM, firstly, the list of sections is divided to specific subsets. Then, intermediate member of each subset, as representative of subset, is defined...
متن کاملA new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کاملNew Genetic Local Search Operators for the Traveling Salesman Problem
In this paper an approach is presented to incorporate prob lem speci c knowledge into a genetic algorithm which is used to compute near optimum solutions to traveling salesman problems TSP The ap proach is based on using a tour construction heuristic for generating the initial population a tour improvement heuristic for nding local optima in a given TSP search space and new genetic operators fo...
متن کاملA Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems
| The combination of local search heuristics and genetic algorithms is a promising approach for nding near-optimum solutions to the traveling salesman problem (TSP). In this paper, an approach is presented in which local search techniques are used to nd local optima in a given TSP search space, and genetic algorithms are used to search the space of local optima in order to nd the global optimum...
متن کامل